Subscription-enhanced Content Delivery

نویسندگان

  • Mao Chen
  • Jaswinder Pal Singh
  • Andrea LaPaugh
چکیده

In existing content delivery systems user accesses are popularly used for predicting the request pattern of contents. In novel web applications such as publish/subscribe services, users explicitly provide statements of interest in the form of subscriptions. These subscriptions provide another source of user information in addition to access patterns. This paper addresses the content delivery problem when user-stated interest is available. Each request by a user is either based on a notification about the availability of content that matches the user’s subscriptions, or general browsing that is not based on the publish/subscribe service. We propose two approaches to content delivery that exploit both proactive push-time placement and passive access-time replacement based on the subscription information, the access pattern of subscribers, and that of non-subscribers. In our simulation-based evaluation, the two approaches are compared to an access-based caching only algorithm and to three approaches that were proposed for pure notification-driven accesses in our earlier study [5]. The results demonstrate that incorporating subscription information judiciously can substantially reduce the response time, even when only a small portion of accesses is driven by notifications and the subscription information does not reflect subscribers’ accesses perfectly. To our knowledge, this work is the first effort to investigate general content delivery and caching enhanced by using subscription information.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Privacy-Preserving Publish Subscribe Middleware

We address the problem of privacy in publish-subscribe (pubsub) systems that typically expose some form of published content and subscriber interest, at least to the infrastructure responsible for subscription matching and content delivery, and possibly to other participants depending on the implementation. In our recent work, we proposed P3S, a pub-sub middleware designed to protect the privac...

متن کامل

A General Algorithmic Model for Subscription Propagation and Content-based Routing with Delivery Guarantees

This paper examines the problem of subscription propagation and aggregation in content-based publish/subscribe systems. We present a general model for subscription propagation and content-based routing and the correctness criteria for it to support reliable delivery. This formal model is used to construct a generic subscription propagation algorithm for asynchronous contentbased routing network...

متن کامل

Subscription Propagation and Content-Based Routing with Delivery Guarantees

Subscription propagation enables efficient content-based routing in publish/subscribe systems and is a challenging problem when it is required to support reliable delivery in networks with redundant routes. We have designed a generic model and a highly-asynchronous algorithm accomplishing these goals. Existing algorithms can be interpreted as different encodings and optimizations of the generic...

متن کامل

Subscription Propagation in Highly-Available Publish/Subscribe Middleware

Achieving availability and scalability while providing service guarantees such as in-order, gapless delivery is essential for deploying publish/subscribe messaging middleware in wide area networks. Scalability often requires a publish/subscribe system to propagate subscription information and perform content matching across the network. Existing subscription propagation algorithms do not suppor...

متن کامل

An efficient and scalable framework for content-based publish/subscribe systems

Challenges for content-based publish/subscribe systems include efficient subscription management and event matching, load balancing, and efficient and scalable event delivery. This paper presents an efficient and scalable framework for content-based publish/subscribe systems. We propose using K-D trees to dynamically partition and organize subscriptions, thereby preserving subscription locality...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003